Implementation of Symmetric Dynamic Programming Stereo Matching Algorithm Using CUDA
نویسنده
چکیده
Stereo correspondence is a computationally intensive procedure, real-time depth map generation for high resolution video is beyond the capability of mainstream CPUs available today. Similar to many other vision algorithms, there is a high degree of parallelism available in most of the correspondence algorithms, making multiprocessor architectures as an obvious choice. Here we describe the implementation of Symmetric dynamic Programming Stereo (SDPS) for graphic processing units (GPU). We discuss the performance results of it on different GPUs. Our implementation focuses on real-time depth map generation for high resolution video pairs, including their lens distortion removal and stereo rectification on GPU.
منابع مشابه
Realtime Dense Stereo Matching with Dynamic Programming in CUDA
Real-time depth extraction from stereo images is an important process in computer vision. This paper proposes a new implementation of the dynamic programming algorithm to calculate dense depth maps using the CUDA architecture achieving real-time performance with consumer graphics cards. We compare the running time of the algorithm against CPU implementation and demonstrate the scalability prope...
متن کاملImproved Noise-driven Concurrent Stereo Matching Based on Symmetric Dynamic Programming Stereo
We describe a new version of the two-stage noisedriven concurrent stereo matching (NCSM) algorithm that uses symmetric dynamic programming stereo (SDPS) to estimate image noise and build candidate volumes for placing goal surfaces. In contrast to the initial NCSM, SDPS is first applied successively in xand y-directions in order to obtain a more stable disparity map from points that coincide in ...
متن کاملFast Visual Hull and Stereo Matching on Cuda
Stereo matching and visual hull are techniques that are often used in 3D reconstruction. This paper presents and evaluates implementations of these algorithms on the GPU using the CUDA architecture. Experimental results show that both, visual hull and stereo matching, have much to gain in terms of speed from the data parallel execution model.
متن کاملA GPU Implementation of Dynamic Programming for the Optimal Polygon Triangulation
This paper presents a GPU (Graphics Processing Units) implementation of dynamic programming for the optimal polygon triangulation. Recently, GPUs can be used for general purpose parallel computation. Users can develop parallel programs running on GPUs using programming architecture called CUDA (Compute Unified Device Architecture) provided by NVIDIA. The optimal polygon triangulation problem fo...
متن کاملStereo Matching Using Iterative Dynamic Programming Based on Color Segmentation of Images
The traditional dynamic programming stereo matching algorithms usually adopt the disparity assumption based on the intensity change of images; With the development of stereo matching technique, the disparity assumption based on image color segmentation is proved to meet better the need of true scenes. The paper introduces the disparity assumption into the stereo matching using dynamic programmi...
متن کامل